Optimal Qubit Assignment and Routing via Integer Programming

We consider the problem of mapping a logical quantum circuit onto given hardware with limited 2-qubit connectivity. model this as an integer linear program, using network flow formulation binary variables that includes initial allocation qubits and their routing. several cost functions: approximation fidelity circuit, its total depth, measure cross-talk, all which can be incorporated in model. Numerical experiments on synthetic data different topologies indicate error rate depth optimized simultaneously without significant loss. test our algorithm large number volume circuits, optimizing for depth; significantly reduces CNOTs compared to Qiskit’s default transpiler SABRE [ 19 ] produces circuits that, when executed hardware, exhibit higher fidelity.